An adaptive algorithm for super-peer selection considering peer's capacity in mobile peer-to-peer networks based on learning automata
نویسندگان
چکیده
Mobile peer-to-peer (MP2P) networks refer to the peer-to-peer overlay networks superimposing above the mobile ad-hoc networks. Heterogeneity of capacity and mobility of the peers as well as inherent limitation of resources along with the wireless networks characteristics are challenges on MP2P networks. In some MP2P networks, in order to improve network performances, special peers, are called super-peers, undertake to perform network managerial tasks. Selection of super-peers, due to their influential position, requires a protocol which considers the capacity of peers. Lack of general information about the capacity of other peers, as well as peers mobility along with dynamic nature of MP2P networks are the major challenges that impose uncertainty in decision making of the super-peer management algorithms. This paper proposes an adaptive super-peer selection algorithm considering peers capacity based on learning automata in MP2P networks, called SSBLA. In the proposed algorithm, each peer is equipped with a learning automaton which is used locally in the operation of super-peer selection by that peer. It has been shown that the suggested algorithm is superior to the existing algorithms. The results of the simulation show that the proposed algorithm can maximize capacity utilization by minimum number of super-peer and improve robustness against failures of super-peers while minimizing selection communication overhead. 1. Introduction Mobile Peer-to-Peer (MP2P) network refers to an overlay network superimposing above a mobile ad-hoc network. The main purposes of these networks are sharing resources (i.e., data, CPU cycles, memory, storage space and bandwidth) among mobile peers as well as coordination of the services. Consider the following scenario: we have a mobile phone with 1GB memory storage and a couple of different radios. While sitting at a restaurant or walking in a shopping mall, one can subscribe and join a local P2P network to see what other people around have offered to share in their mobile devices. The shared content could be a MP3 file or a movie, or even a game. MP2P networks have good scalability, robustness, and low-cost self-organization. Also they can admit the user's request of connection to the network at any time. However, MP2P network has additional challenges, such as: capacity heterogeneity, strong mobility of peers, inherent limitation of resources and wireless network characteristics [1-3].The topology of the whole network can becomes different cause the highly dynamic property. It can also lead to lack of consistency between the overlay network and the topology of the underlying physical network. …
منابع مشابه
A Learning Automata-Based Version of SG-1 Protocol for Super-Peer Selection in Peer-to-Peer Networks
Super-peer topologies have been found efficient and effective in heterogeneous peer-to-peer networks. Due to dominant position of super-peers, super-peer selection requires a protocol that is aware of peer capacities. Lack of global information about other peers capacity and dynamic nature of peer-to-peer networks are two major challenges that impose uncertainty in decisionmaking. SG-1, is a we...
متن کاملA Delay Aware Super-Peer Selection Algorithm for Gradient Topology Utilizing Learning Automata
Peer-to-peer network is organized on top of another network as an overlay network. Super peer network is one of the peer-to-peer networks. A super peer, in a super peer based network, is a peer that has more responsibility than other peers have and is responsible for some of the tasks of network management. Since different peers vary in terms of capabilities, selecting a super peer is a challen...
متن کاملA distributed adaptive landmark clustering algorithm based on mOverlay and learning automata for topology mismatch problem in unstructured peer-to-peer networks
Peer-to-peer networks are overlay networks that are built on top of communication networks that are called underlay networks. In these networks, peers are unaware of the underlying networks, so the peers choose their neighbors without considering the underlay positions, and therefore, the resultant overlay network may have mismatches with its underlying network, causing redundant end-to-end del...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Peer-to-Peer Networking and Applications
دوره 11 شماره
صفحات -
تاریخ انتشار 2018